On EXIT-Charts for Space-Time Block Codes
نویسندگان
چکیده
In this work, we consider the application of the well-known space-time block code (STBC), the Alamouti-scheme, as inner code within a “turbo” coding scheme for the multiple-input-multiple-output (MIMO) Rayleigh fading channel. We analyze therefore the applicability of the Alamouti-scheme for iterative space-time detection and decoding applied at the receiver. To this end, we use extrinsic information transfer characteristics (EXIT-charts) in order to predict the performance of the Alamouti-scheme. Furthermore, we analyze the impact of different mapping strategies on the information transfer of the soft-input-soft-output (SISO) space-time detector and show analytically that it is possible to improve the performance by employing other mapping schemes than Gray mapping. I. Characterizing different mappings by mutual information and EXIT-charts In the following, we analyze the impact of different 8PSK mappings (analogous to [1]) on the transfer characteristics of the detector for an AWGN channel. The extension to a Rayleigh fading channel is straightforward. With the chain rule of mutual information it can be shown that the mutual information I(s; r) = I(c; r) = I(c1, . . . , cm; r) between transmitted constellation symbol s = f(c) and received AWGN channel output r (assuming that all constellation symbols are equiprobable) can be decomposed into I(c; r) = ∑m−1 L=0 IL, where IL is the average mutual information [1], when L bits are already known to the receiver. Hence, for 8PSK (m=3) we have I0 = 1 m(m−1 0 ) m ∑ i=1 I(ci; r) ; I1 = 1 m(m−1 1 ) m ∑
منابع مشابه
Design of Capacity Approaching Ensembles of LDPC Codes for Correlated Sources using EXIT Charts
This paper is concerned with the design of capacity approaching ensembles of Low-Densiy Parity-Check (LDPC) codes for correlated sources. We consider correlated binary sources where the data is encoded independently at each source through a systematic LDPC encoder and sent over two independent channels. At the receiver, a iterative joint decoder consisting of two component LDPC decoders is cons...
متن کاملHow to obtain turbo gains in coherent and non-coherent orthogonal transmit diversity
— We consider turbo detection for coherent and non-coherent orthogonal transmit diversity. The turbo iterations are done between a convolutional code and the diversity combiner. We show that due to the orthogonal structure of the space-time block codes, extrinsic information which enables turbo gains can only be obtained for special symbol mappings. Such optimized symbol mappings are given for ...
متن کاملSpace-Time Codes for MIMO Systems: Quasi-Orthogonal Design and Concatenation
The demand for mobile communication systems with high data rates and improved link quality for a variety of applications has dramatically increased in recent years. New concepts and methods are necessary in order to cover this huge demand, which counteract or take advantage of the impairments of the mobile communication channel and optimally exploit the limited resources such as bandwidth and p...
متن کاملCooperative Orthogonal Space-Time-Frequency Block Codes over a MIMO-OFDM Frequency Selective Channel
In this paper, a cooperative algorithm to improve the orthogonal space-timefrequency block codes (OSTFBC) in frequency selective channels for 2*1, 2*2, 4*1, 4*2 MIMO-OFDM systems, is presented. The algorithm of three node, a source node, a relay node and a destination node is formed, and is implemented in two stages. During the first stage, the destination and the relay antennas receive the sym...
متن کاملClevorn, Vary, Adrat: ISCD using Short Block Codes
Iterative source-channel decoding (ISCD) exploits the residual redundancy of the source, e.g., codec parameters, for quality improvements. In contrast to the well-known convolutional coded ISCD systems, we propose in this paper an ISCD scheme which features a superior performance but is based solely on two short block codes. The block codes serve as highly redundant index assignment and rate-1 ...
متن کامل